a = input()
b = input()
if a == '0' and b == '0' :
print('OK')
exit()
c = []
for i in a :
c.append(i)
c.sort()
d = ''
for i in c :
d += i
if c[0] == '0':
if len(d) > 1:
e = d[1] + d[0] + d[2:]
if e[0] == '0' :
print('WRONG_ANSWER')
elif e == b:
print('OK')
else:
print('WRONG_ANSWER')
else:
print('WRONG_ANSWER')
else:
if d == b :
print('OK')
else:
print('WRONG_ANSWER')
#include <cstdio>
#include <iostream>
#include <string>
int main(){
std::string input(""), answer(""), output("");
getline(std::cin, input);
getline(std::cin, answer);
int count[10] = {0};
char minNonZero('A');
for(int k = 0; k < input.size(); k++){
++count[input[k] - '0'];
if(input[k] > '0' && input[k] < minNonZero){minNonZero = input[k];}
}
if(minNonZero == 'A'){output = "0";}
else{
--count[minNonZero - '0'];
output += minNonZero;
for(int digit = 0; digit < 10; digit++){while(count[digit]--){output += ('0' + digit);}}
}
if(answer == output){puts("OK");}
else{puts("WRONG_ANSWER");}
return 0;
}368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |